Search Results/Filters    

Filters

Year

Banks




Expert Group











Full-Text


Writer: 

SADEGHI J. | MOHEBI H.

Issue Info: 
  • Year: 

    2017
  • Volume: 

    1
Measures: 
  • Views: 

    238
  • Downloads: 

    0
Abstract: 

THE OBJECTIVE OF THIS PAPER IS TO FIND A METHOD FOR FINDING THE WEAKLY EFFICIENT POINTS OF A LINEAR MULTIOBJECTIVE OPTIMIZATION PROBLEM IN RN. IF THERE EXISTS TWO OBJECTIVE FUNCTIONS IN THE MULTI-OBJECTIVE OPTIMIZATION PROBLEM, SINCE THE OBJECTIVE FUNCTIONS THE PROBLEM ARE LINEAR, THE WEAKLY EFFICIENT POINTS OF THIS PROBLEM ARE EASILY FOUND. BY USE OF THE WEAKLY EFFICIENT POINTS OF TWO FUNCTIONS IN THE MULTIOBJECTIVE OPTIMIZATION PROBLEM, WE OBTAIN THE WEAKLY EFFICIENT POINTS OF THE MAIN PROBLEM. AT THE END THE PROPOSED METHOD IS CODED BY MATLAB LANGUAGE AND EVALUATED FOR SOME EXAMPLES.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 238

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0
Issue Info: 
  • Year: 

    2020
  • Volume: 

    17
  • Issue: 

    3 (66)
  • Pages: 

    1-22
Measures: 
  • Citations: 

    0
  • Views: 

    2047
  • Downloads: 

    0
Abstract: 

The fuzzy primal-dual simplex method is a new and efficient method for solving LINEAR programming problems with fuzzy variables. This algorithm is based on duality results and, similar to the dual simplex method, begins with dual feasibility and proceeds to primal feasibility. An important difference between the dual simplex method and the primal-dual method is that in the primal-dual algorithm, it is not required that the dual feasible solution to be basic. In this paper, we develop the primal-dual simplex method for solving fuzzy MULTIOBJECTIVE LINEAR programming problems. To this end, we utilize the fuzzy weighted sum scalarization method to present a fuzzy single objective OPTIMIZATION problem related to the fuzzy MULTIOBJECTIVE LINEAR programming problem. Then, by partitioning the weights of the weighted sum problem, we generalize the single objective primal-dual algorithm to fuzzy MULTIOBJECTIVE problems. By using the presented algorithm, we can find a set of fuzzy Pareto optimal solutions. Presenting a set of fuzzy Pareto optimal solutions to the decision maker, enables him\her to select the best solution based on his\her preferences. Finally, we apply the proposed algorithm for solving a three-objective OPTIMIZATION problem with fuzzy variables and compare the results with some existing methods.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 2047

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2013
  • Volume: 

    44
Measures: 
  • Views: 

    159
  • Downloads: 

    93
Abstract: 

THIS PAPER SUGGESTS AN ITERATIVE CONVERGENT METHOD FOR FINDING A DISCRETE APPROXIMATION TO THE NONDOMINATED SET OF A MULTI OBJECTIVE LINEAR FRACTIONAL PROGRAMMING PROBLEM. THE METHOD IS ORGANIZED SO THAT THE RESULTING APPROXIMATION SET HAS ACCEPTABLE QUALITY MEASURES. THE RESULTING SET IS AN E -APPROXIMATION TO THE NONDOMINATED SET WHERE E IS A TOLERANCE VECTOR. ALSO, IT DOES NOT GENERATE REDUNDANT INFORMATION.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 159

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 93
Issue Info: 
  • Year: 

    2015
  • Volume: 

    8
Measures: 
  • Views: 

    156
  • Downloads: 

    115
Abstract: 

AN INTERACTIVE METHOD FOR SOLVING A TYPE-2 FUZZY MULTIOBJECTIVE LINEAR PROGRAMMING PROBLEM IS PRESENTED IN THIS RESEARCH, WHICH OBTAINS THE SATISFICING PARETO OPTIMAL SOLUTIONS OF THE PROBLEM.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 156

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 115
Issue Info: 
  • Year: 

    2002
  • Volume: 

    -
  • Issue: 

    -
  • Pages: 

    603-607
Measures: 
  • Citations: 

    1
  • Views: 

    167
  • Downloads: 

    0
Keywords: 
Abstract: 

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 167

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Author(s): 

OLIVEIRA L. | SARAMAGO S.

Issue Info: 
  • Year: 

    2010
  • Volume: 

    32
  • Issue: 

    1
  • Pages: 

    94-105
Measures: 
  • Citations: 

    1
  • Views: 

    199
  • Downloads: 

    0
Keywords: 
Abstract: 

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 199

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    621
  • Volume: 

    13
  • Issue: 

    1
  • Pages: 

    105-120
Measures: 
  • Citations: 

    0
  • Views: 

    5
  • Downloads: 

    0
Abstract: 

In this paper, we focus on the utilization of the feasible value constraint technique to address MULTIOBJECTIVE OPTIMIZATION problems (MOPs). It is attempted to overcome certain drawbacks associated with this method, such as restrictions on functions and weights, inflexibility in constraints, and challenges in assessing proper efficiency. To accomplish this, we propose an improved version of the feasible value constraint technique. Then, by incorporating approximate solutions, we establish connections between $\varepsilon$-(weakly, properly) efficient points in a general MOP and $\epsilon$-optimal solutions to the scalarization problem.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 5

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2015
  • Volume: 

    46
Measures: 
  • Views: 

    143
  • Downloads: 

    61
Abstract: 

IN THIS PAPER, WE PROPOSE A NEWTON-TYPE ALGORITHM FOR NONCONVEX MULTIOBJECTIVE OPTIMIZATION PROBLEMS. THE PRESENTED TERMINATES, WHEN THE TERMINATION CONDITIONS ARE SATISFIED. CONVERGENCE OF THE ALGORITHM IS CONSIDERED.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 143

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 61
Issue Info: 
  • Year: 

    2013
  • Volume: 

    13
  • Issue: 

    6
  • Pages: 

    60-73
Measures: 
  • Citations: 

    1
  • Views: 

    1599
  • Downloads: 

    0
Abstract: 

In this paper, the artificial neural network based multi-objective OPTIMIZATION of twist extrusion process is carried out. The target purpose functions are equivalent plastic strain, strain distribution and extrusion force. The design variables are twistangle, friction factor and loading rate. The FEM model of the process is first created and used to create training cases for the ANN, and the well-trained ANN is used as a quick and exact model of the process. Then the OPTIMIZATION of the design variables is conducted by an integrated genetic algorithm and ANN modelto create a set of optimal solutions (Pareto front). Leveldiagrams are then used to select the best solution from the Pareto front. Finally the response surface methodology has been used to study the interaction between the design parameters. The obtained results show that the best range of twist angle is from 0.7 to 45 degree, friction factor from 0.65 to 0.7 and loading rate from 6.5 to 7 mm/s. Also variables with the largest effect on the process are twist angle and friction factor.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 1599

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 2
Issue Info: 
  • Year: 

    2013
  • Volume: 

    5
Measures: 
  • Views: 

    141
  • Downloads: 

    61
Abstract: 

IN THIS PAPER, WE ARE GOING TO PROPOSE A GLOBAL INTERACTIVE ALGORITHM ENABLING THE DECISION MAKER (DM) TO APPLY FREELY SEVERAL CONVENIENT METHODS WHICH BEST FIT HIS/HER PREFERENCES. TO THIS END, A GENERAL SCALARIZING PROBLEM FOR MULTI-OBJECTIVE PROGRAMMING IS SUGGESTED AND THE RELATION BETWEEN OPTIMAL SOLUTIONS OF THE INTRODUCED SCALARIZED PROBLEM AND (WEAKLY, PROPERLY) EFFICIENT SOLUTIONS OF THE MAIN MULTI-OBJECTIVE OPTIMIZATION PROBLEM (MOP) IS DISCUSSED. UTILIZING THE PROPOSED SCALARIZED PROBLEM, WE SUGGEST AN INTERACTIVE METHOD THAT ENABLES THE DM TO SPECIFY HIS/HER PREFERENCES IN DIFFERENT WAYS WITH CAPABILITY TO CHANGE HIS/HER PREFERENCES ANYTIME DURING THE ITERATIONS OF THE ALGORITHM.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 141

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 61
litScript
telegram sharing button
whatsapp sharing button
linkedin sharing button
twitter sharing button
email sharing button
email sharing button
email sharing button
sharethis sharing button